Counting the Number of Proofs in the Commutative Lambek Calculus
نویسنده
چکیده
This paper is concerned with the study of the number of proofs of a sequent in the commutative Lambek calculus. We show that in order to count how many different proofs in βη-normal form a given sequent Γ ` α has, it suffices to enumerate all the ∆ ` β which are “minimal”, such that Γ ` α is a substitution instance of ∆ ` β. As a corollary we obtain van Benthem’s finiteness theorem for the Lambek calculus, which states that every sequent has finitely many different normal form proofs in the Lambek calculus.
منابع مشابه
Partially Commutative Linear Logic and Lambek Caculus with Product: Natural Deduction, Normalisation, Subformula Property
This article defines and studies a natural deduction system for partially commutative intuitionistic multiplicative linear logic, that is a combination of intuitionistic commutative linear logic with the Lambek calculus, which is noncommutative, and was first introduced as a sequent calculus by de Groote. In this logic, the hypotheses are endowed with a series-parallel partial order: the parall...
متن کاملLambek Calculus Proofs and Tree Automata
We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of all proofs. While Lambek grammars can assign...
متن کاملNormalization and sub-formula property for Lambek with product and PCMLL - Partially Commutative Multiplicative Linear Logic
This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic — which involves both commutative and non commutative connectives. This calculus first introduced by de Groote and as opposed to the classical version by Abrusci and Ruet admits a full entropy which allow order to be relaxed into any suborder. Our result also incl...
متن کاملProof nets for the Lambek calculus — an overview
There are both linguistic and mathematical reasons for studying proof nets the perspective of categorial grammar. It is now well known that the Lambek calculus corresponds to intuitionnistic non-commutative multiplicative linear logic — with no empty antecedent, to be absolutely precise. As natural deduction underlines the constructive contents of intuitionistic logic (Curry-Howard isomorphism)...
متن کاملNormal Form Theorem Proving for the Lambek Calculus
The possibility of multiple equivalent proofs presents a problem for efficient parsing of a number of flexible categorial grammar (CG) frameworks. In this paper I outline a normal form system for a sequent formulation of the product-free associative Lambek Calculus. This le,'~ls to a simple parsing approach that yields only normal form proofs. This approach is both ~afe in that all distinct rea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999